Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
x * (y + z) |
→ (x * y) + (x * z) |
| 2: |
|
(x + y) * z |
→ (x * z) + (y * z) |
| 3: |
|
x * 1 |
→ x |
| 4: |
|
1 * y |
→ y |
|
There are 4 dependency pairs:
|
| 5: |
|
x *# (y + z) |
→ x *# y |
| 6: |
|
x *# (y + z) |
→ x *# z |
| 7: |
|
(x + y) *# z |
→ x *# z |
| 8: |
|
(x + y) *# z |
→ y *# z |
|
The approximated dependency graph contains one SCC:
{5-8}.
-
Consider the SCC {5-8}.
There are no usable rules.
By taking the AF π with
π(*#) = 1 together with
the lexicographic path order with
empty precedence,
the rules in {5,6}
are weakly decreasing and
the rules in {7,8}
are strictly decreasing.
There is one new SCC.
-
Consider the SCC {5,6}.
By taking the AF π with
π(*#) = 2 together with
the lexicographic path order with
empty precedence,
the rules in {5,6}
are strictly decreasing.
Hence the TRS is terminating.
Tyrolean Termination Tool (0.01 seconds)
--- May 4, 2006